An accelerated forward-backward splitting algorithm for solving inclusion problems with applications to regression and link prediction problems
نویسندگان
چکیده
منابع مشابه
Second Order Forward-Backward Dynamical Systems For Monotone Inclusion Problems
We begin by considering second order dynamical systems of the from ẍ(t) + Γ(ẋ(t)) + λ(t)B(x(t)) = 0, where Γ : H → H is an elliptic bounded self-adjoint linear operator defined on a real Hilbert space H, B : H → H is a cocoercive operator and λ : [0,+∞)→ [0,+∞) is a relaxation function depending on time. We show the existence and uniqueness of strong global solutions in the framework of the Cau...
متن کاملAn Adaptive Approach to Increase Accuracy of Forward Algorithm for Solving Evaluation Problems on Unstable Statistical Data Set
Nowadays, Hidden Markov models are extensively utilized for modeling stochastic processes. These models help researchers establish and implement the desired theoretical foundations using Markov algorithms such as Forward one. however, Using Stability hypothesis and the mean statistic for determining the values of Markov functions on unstable statistical data set has led to a significant reducti...
متن کاملA numerical scheme for solving nonlinear backward parabolic problems
In this paper a nonlinear backward parabolic problem in one dimensional space is considered. Using a suitable iterative algorithm, the problem is converted to a linear backward parabolic problem. For the corresponding problem, the backward finite differences method with suitable grid size is applied. It is shown that if the coefficients satisfy some special conditions, th...
متن کاملOn the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
We present two modified versions of the primal-dual splitting algorithm relying on forward-backward splitting proposed in [21] for solving monotone inclusion problems. Under strong monotonicity assumptions for some of the operators involved we obtain for the sequences of iterates that approach the solution orders of convergence of O( 1 n) and O(ωn), for ω ∈ (0, 1), respectively. The investigate...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of nonlinear and variational analysis
سال: 2021
ISSN: ['2560-6778', '2560-6921']
DOI: https://doi.org/10.23952/jnva.5.2021.1.06